Block Transitive Meager Squares over GF (q) for prime q
نویسنده
چکیده
This paper shows the existence of a class of block transitive meager squares of order q on GF (q) for odd prime q, q large. Using these meager squares along with other known meager system constructions, we determine the spectrum of orders that admit meager systems: all odd n, n ≥ 9. Using this result, it is also determined that the spectrum of orders that admit 5-sparse Steiner triple systems includes n ≡ 3 mod 6, n ≥ 21.
منابع مشابه
Automorphism Groups of Designs*
From a geometric point of view, the most interesting designs (see w 2 for definitions) are generally those admitting fairly large automorphism groups. The methods of finite permutat ion groups may be applied to such designs, and vice versa, as in [5, 6, 8, 11, 13 and 143. We shall prove several general results which are useful in the study of automorphism groups of designs, and then use some of...
متن کاملBlock Transitive 2 − ( v , 13 , 1 ) Designs and Classical Simple Groups
This article is a contribution to the study of the automorphism groups of 2−(v, k, 1) designs. Let D be 2−(v, 13, 1) design, G ≤ Aut(D) be block transitive, point primitive but not flag transitive. Then Soc(G), the socle of G, is not classical simple group over finite filed GF (q)(q odd). Mathematics Subject Classification: 05B05, 20B25
متن کاملBlock - Transitive 2 - ( v , k , 1 ) Designs and Groups E 6 ( q ) Guang
This article is a contribution to the study of block-transitive automorphism groups of 2-(v, k, 1) block designs. Let D be a 2-(v, k, 1) design admitting a block-transitive, pointprimitive but not flag-transitive automorphism group G. Let kr = (k, v − 1) and q = p f for prime p. In this paper we prove that if G and D are as above and q > (3(krk − kr + 1)f) , then G does not admit a simple group...
متن کاملExistence of 2-(v, k, 1) Designs Admitting a Block-Transitive Group of Affine Type
In this paper we use Weil’s estimate on character sums to prove that large admissible prime powers q admit 2-(q, k, 1) designs having block-transitive automorphism groups in AGL(1, q).
متن کاملFast Algorithms for Determining the Linear Complexity of Period Sequences
We introduce a fast algorithm for determining the linear complexity and the minimal polynomial of a sequence with period p over GF(q) , where p is an odd prime, q is a prime and a primitive root modulo p; and its two generalized algorithms. One is the algorithm for determining the linear complexity and the minimal polynomial of a sequence with period pq over GF(q), the other is the algorithm fo...
متن کامل